Constrained Minkowski Sums of Polyhedra with an Application in Unit Commitment
نویسندگان
چکیده
We present a perfect formulation for a single generator in the unit commitment problem, inspired by the dynamic programming approach taken by Frangioni and Gentile. This generator can have characteristics such as ramping constraints, time-dependent start-up costs, and start-up/shut-down ramping. To develop this perfect formulation we extend the result of Balas on unions of polyhedra to present a framework allowing for flexible combinations of polyhedra using indicator variables.
منابع مشابه
Reliability-Constrained Unit Commitment Considering Interruptible Load Participation
From the optimization point of view, an optimum solution of the unit commitment problem with reliability constraints can be achieved when all constraints are simultaneously satisfied rather than sequentially or separately satisfying them. Therefore, the reliability constraints need to be appropriately formulated in terms of the conventional unit commitment variables. In this paper, the reli...
متن کاملExact Minkowski sums of polyhedra and exact and efficient decomposition of polyhedra in convex pieces
We present the first exact and robust implementation of the 3D Minkowski sum of two non-convex polyhedra. Our implementation decomposes the two polyhedra into convex pieces, performs pairwise Minkowski sums on the convex pieces, and constructs their union. We achieve exactness and the handling of all degeneracies by building upon 3D Nef polyhedra as provided by Cgal. The implementation also sup...
متن کاملExact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications
We present an exact implementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in R. Our implementation is complete in the sense that it does not assume general position. Namely, it can handle degenerate input, and it produces exact results. We also present applications of the Minkowski-sum computation to answer collision and proximity queries about the relative p...
متن کاملSolving Security Constrained Unit Commitment by Particle Swarm Optimization
The issue of unit commitment is one of the most important economic plans in power system. In modern and traditional power systems, in addition to being economical of the planning, the issue of security in unit operation is also of great importance. Hence power system operation confronts units’ participation and input considering network security constrains. The issue of units’ participation is ...
متن کاملMinkowski Sum Construction and other Applications of Arrangements of Geodesic Arcs on the Sphere
We present two exact implementations of efficient output-sensitive algorithms that compute Minkowski sums of two convex polyhedra in R. We do not assume general position. Namely, we handle degenerate input, and produce exact results. We provide a tight bound on the exact maximum complexity of Minkowski sums of polytopes in R in terms of the number of facets of the summand polytopes. The complex...
متن کامل